Resolving Occlusion Method of Virtual Object in Simulation Using Snake and Picking Algorithm

For realistic simulation, it is essential to register the two worlds, calculate the occlusion realm between the real world and the virtual object, and determine the location of the virtual object based on the calculation. However, if the constructed map is not accurate or the density is not sufficient to estimate the occlusion boundary, it is very difficult to determine the occlusion realm. In order to solve this problem, this paper proposes a new method for calculating the occlusion realm using the snake and picking algorithm. First, the wireframe generated by the CCD image and DEM was mapped using the visual clues to acquire 3D information in the experimental realm, and the 3D information was calculated at the point where occlusion problem for a moving target. The validity of the proposed approach under the environment in which partial occlusion occurs has been provided by an experiment.